Simpler proof for nonlinearity of majority function

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simpler proof for nonlinearity of majority function

Given a Boolean function f , the (Hamming) weight wt(f) and the nonlinearity N(f) are well known to be important in designing functions that are useful in cryptography. The nonlinearity is expensive to compute, in general, so any formulas giving the nonlinearity for particular functions f are significant. The well known majority function has been extensively studied in a cryptographic context f...

متن کامل

A Simpler Proof Theory for Nominal Logic

Nominal logic is a variant of first-order logic which provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these...

متن کامل

A Simpler proof of Jensen's Coding Theorem

[82] provides a proof of Jensen's remarkable Coding Theorem , which demonstrates that the universe can be included in L[R] for some real R, via class forcing. The purpose of this article is to present a simpler proof of Jensen's theorem, obtained by implementing some changes first developed for the theory of strong coding (Friedman [87]). The basic idea is to first choose A ⊆ ORD so that V = L[...

متن کامل

A simpler proof for O(congestion + dilation) packet routing

In the store-and-forward routing problem, packets have to be routed along given paths such that the arrival time of the latest packet is minimized. A groundbreaking result of Leighton, Maggs and Rao says that this can always be done in time O(congestion+dilation), where the congestion is the maximum number of paths using an edge and the dilation is the maximum length of a path. However, the ana...

متن کامل

An Alternative Stability Proof for Direct Adaptive Function Approximation Techniques Based Control of Robot Manipulators

This short note points out an improvement on the robust stability analysis for electrically driven robots given in the paper. In the paper, the author presents a FAT-based direct adaptive control scheme for electrically driven robots in presence of nonlinearities associated with actuator input constraints. However, he offers not suitable stability analysis for the closed-loop system. In other w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2021

ISSN: 0166-218X

DOI: 10.1016/j.dam.2021.02.031